Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
671	Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-03 17:31:15 Planar graphs Network theory Directed acyclic graph Graph coloring Shortest path problem Hypercube graph Planarity testing Hamiltonian path Tree Graph theory Theoretical computer science NP-complete problems
672	Logic and Lattices for Distributed Programming Neil Conway William R. Marczak Peter Alvaro Add to Reading List Source URL: www.neilconway.org Language: English - Date: 2012-10-01 13:10:36 Lattice theory Algebra Order theory Lattice Monotonic function Boolean algebra Semilattice Complete Heyting algebra Complete lattice Abstract algebra Mathematics Algebraic structures
673	W h e r e t h e Really H a r d P r o b l e m s A r e Peter Cheeseman Bob Kanefsky W i l l i a m M . Taylor Add to Reading List Source URL: www.dcs.gla.ac.uk Language: English - Date: 2009-10-23 06:18:38 Complexity classes NP-complete problems Mathematical optimization Graph theory Graph coloring NP-complete Connectivity 2-satisfiability NP Theoretical computer science Computational complexity theory Mathematics
674	C HICAGO J OURNAL OF T HEORETICAL C OMPUTER S CIENCE 2013, Article 09, pages 1–6 http://cjtcs.cs.uchicago.edu/ Complexity of the homomorphism extension problem in the random case Alexandr Kazda∗ Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-07-24 06:23:43 Applied mathematics Mathematical optimization Graph theory Structure Homomorphism NP-complete Graph homomorphism FO Finitary relation Mathematics Complexity classes Morphisms
675	Unique Games on the Hypercube Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2015-02-07 14:10:22 NP-complete problems Combinatorial optimization Linear programming Operations research Real algebraic geometry Semidefinite programming Maximum cut Vertex cover Hypercube graph Theoretical computer science Graph theory Mathematics
676	1991: The Steiner Tree Problem: The Steiner Tree Problem Add to Reading List Source URL: www.comap.com Language: English - Date: 2014-07-31 15:13:23 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Euclidean geometry Distance Operations research Rectilinear Steiner tree Graph theory Theoretical computer science Mathematics
677	ARC MINIMIZATION IN FINITE STATE DECODING GRAPHS WITH CROSS-WORD ACOUSTIC CONTEXT G. Zweig, G. Saon F. Yvon Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2002-08-23 18:15:24 Bipartite graph NP-complete problems Graph operations Bipartite dimension Power graph analysis Graph theory Graph Clique
678	Approximation Hardness of Graphic TSP on Cubic Graphs Marek Karpinski∗ Richard Schmied† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-04-25 00:45:46 NP-complete problems Operations research Combinatorial optimization Travelling salesman problem Cubic graph Hamiltonian path Gadget Degree Regular graph Graph theory Theoretical computer science Mathematics
679	Theory of Computing Systems manuscript No. (will be inserted by the editor) Constant Thresholds Can Make Target Set Selection Tractable Morgan Chopin∗ · Andr´ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-09-10 04:14:52 Graph operations Path decomposition Vertex cover Feedback vertex set Clique Kernelization Dominating set Tree decomposition Vertex Graph theory Theoretical computer science NP-complete problems
680	Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗ Yngve Villanger∗ Add to Reading List Source URL: www.ii.uib.no Language: English - Date: 2013-10-25 09:59:52 Chordal graph Clique Maximal independent set Split graph Tree decomposition Cograph Independent set Neighbourhood Clique-sum Graph theory Graph operations NP-complete problems

UPDATE